Human Long Jump — A Deductive Approach

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Functional Programming Approach to Deductive Databases

We introduce a persistent functional language called PFL which adapts functional programming to the area of deductive databases, much as logic-based deductive database languages adapt logic programming. PFL inherits the advantages of functional programming languages, including higher-order functions, static type checking, lazy evaluation, and support for user-defined types and constants. Howeve...

متن کامل

A Deductive Approach to Design Synthesis

We present a new approach to deductive design synthesis, the Residue Approach, in which designs arc represented as sets of constraints. Previous approaches, such as PROLOG [18] or the work of Manna and W&linger [ 111, express designs as bindings ol-1 single terms. We give a complete and sound proccdurc for finding sets of propositions constituting a legal design. The size of the search space of...

متن کامل

A Deductive Approach towards Controller Synthesis 1

This paper proposes a deductive approach towards controller synthesis. The system to be controlled and the environment are modeled as phase transition systems and the speciication of the entire system is expressed by a hybrid temporal logic formula. Veriica-tion rules are used to determine whether the system in conjunction with a control strategy meets the spec-iication. The control strategy is...

متن کامل

A Deductive Approach to Dependency Parsing

We define a new formalism, based on Sikkel’s parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This abstraction allows us to establish clear relations between several existing projective dependency parsers and prove their correctness.

متن کامل

A Dynamic Approach to Deductive Query Evaluation

In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given a query execution plan obtained by a single magic set transformation, this plan is normally not reoptimized, and the actual number of facts generated during query processing cannot be considered. But applying the magi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Advanced Robotic Systems

سال: 2012

ISSN: 1729-8814,1729-8814

DOI: 10.5772/51036